Beyond algorithmic reformism: Forward engineering the designs of algorithmic systems

Algorithmic aspects of integral designs

Alan Hartman Discrete Optimization Consulting Pty. Ltd. 1 Irene Place, Prahran, VIC. 3181 Australia IBM Israel Science and Technology MATAM Haifa, 31905 Israel email: [email protected] June 1997 A t-design with parameters t (v, k, A.) is a set X of cardinality v, together with a collection of subsets of X of size k called blocks. The number of blocks containing any particular t-subset of ...

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

Algorithmic Engineering Towards More Efficient Key-Value Systems

Distributed key-value systems have been widely used as elemental components of many Internet-scale services at sites such as Amazon, Facebook and Twitter. This thesis examines a system design approach to scale existing key-value systems, both horizontally and vertically, by carefully engineering and integrating techniques that are grounded in recent theory but also informed by underlying archit...

Beyond Keyframing: An Algorithmic Approach to Animation

The use of physical system simulation has led to realistic animation of passive objects, such as sliding blocks or bouncing balls. However, complex active objects like human gures and insects need a control mechanism to direct their movements. We present a paradigm that combines the advantages of both physical simulation and algorithmic speciication of movement. The animator writes an algorithm...

Beyond Serendipity to an Algorithmic Approach